applicative order


applicative order
Программирование: функциональное упорядочение

Универсальный англо-русский словарь. . 2011.

Смотреть что такое "applicative order" в других словарях:

  • Applicative Order Reduction — Die Applicative Order Reduction (AOR) ist eine Ableitungsstrategie beim Lambda Kalkül, um einen Lambda Ausdruck zu dessen Normalform abzuleiten. Es werden zuerst die Argumente ausgewertet und erst dann die Funktionen, die die Argumente benötigen …   Deutsch Wikipedia

  • Applicative programming language — In the classification of programming languages, an applicative programming language is designed to support the development of programs as giving the result of a function of the combined variables. Successive functional transformations are applied …   Wikipedia

  • Normal Order Reduction — Die Normal Order Reduction (NOR) ist eine Ableitungsstrategie beim Lambda Kalkül, um einen Lambda Ausdruck zu dessen Normalform abzuleiten. Bei dieser Strategie wird die lazy evaluation genutzt, bei der die Ausdrücke erst ausgewertet werden, wenn …   Deutsch Wikipedia

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

  • Westminster Mail Order — Sinclair Research Ltd. Logo de Sinclair Research Ltd. Création Cambridge, Angleterre (1961) Personnages clés Sir Clive Sinclair, fondateur …   Wikipédia en Français

  • Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… …   Wikipedia

  • Evaluation strategy — Evaluation strategies Strict evaluation Applicative order Call by value Call by reference Call by sharing Call by copy restore Non strict evaluation Normal order Call by name Call by need/Lazy evaluation …   Wikipedia

  • Beta normal form — In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta redex in… …   Wikipedia

  • Aor — Die Abkürzung AOR steht für: Address of Records, eine bestimmte URI die einem Benutzer fest zugeordnet werden kann Adult oriented Rock, eine Form der Rockmusik, die nicht primär für den jugendlichen Musikkonsumenten produziert wird Album oriented …   Deutsch Wikipedia

  • Fixed-point combinator — Y combinator redirects here. For the technology venture capital firm, see Y Combinator (company). In computer science, a fixed point combinator (or fixpoint combinator[1] ) is a higher order function that computes a fixed point of other functions …   Wikipedia

  • Lisp (programming language) — Infobox programming language name = Lisp paradigm = multi paradigm: functional, procedural, reflective generation = 3GL year = 1958 designer = John McCarthy developer = Steve Russell, Timothy P. Hart, and Mike Levin latest release version =… …   Wikipedia

Книги



Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.